Determining channel coefficients in a multipath channel

ABSTRACT

A device, method, and computer-readable medium are provided. The device includes, but is not limited to, an antenna configured to receive a multipath signal and a processor operably coupled to the antenna to receive the multipath signal. The processor is configured to determine a training signal transmitted from a second device to create the received multipath signal; sample the received multipath signal; and determine channel coefficients based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process, wherein the channel coefficients characterize a channel associated with the multipath signal.

REFERENCE TO GOVERNMENT RIGHTS

This invention was made with United States government support awarded by the following agencies: Navy/ONR N00014-06-1-1123. The United States government has certain rights in this invention.

BACKGROUND

Knowledge of channel state information (CSI) at a transmitter and/or a receiver can have a dramatic impact on communication over multipath channels in terms of power and spectral efficiency. In particular, coherent communication is generally far more efficient than non-coherent communication, but requires that the CSI be known at the receiver to maintain coherence. Training-based schemes, which involve probing the channel with known signaling waveforms and linear processing of the corresponding channel output, are commonly used to learn the CSI at the receiver. Recent measurement studies have shown that physical multipath channels tend to exhibit an approximately sparse multipath structure at high signal space dimension—time-bandwidth-antenna product. The CSI for such channels is characterized with significantly fewer dominant parameters compared to the maximum number dictated by the delay-Doppler-angle spread of the channel. Conventional training-based methods, often based on exhaustive probing coupled with a linear least squares approach or a non-linear parametric estimator, are ill-suited for exploiting the inherently low-dimensional nature of sparse or approximately sparse multipath channels.

SUMMARY

In an illustrative embodiment, a device is provided that includes, but is not limited to, an antenna configured to receive a multipath signal and a processor operably coupled to the antenna to receive the multipath signal. The processor is configured to determine a training signal transmitted from a second device to create the received multipath signal, sample the received multipath signal, and determine channel coefficients based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process, wherein the channel coefficients characterize a channel associated with the multipath signal.

In another illustrative embodiment, a method of determining channel coefficients characterizing a channel associated with a multipath signal is provided. A multipath signal is received at a first device. Using a processor at the first device, a training signal transmitted from a second device to create the received multipath signal is determined, the received multipath signal is sampled, and the channel coefficients are determined based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process.

In yet another illustrative embodiment, a computer-readable medium is provided. The computer-readable medium has computer-readable instructions stored thereon which, when executed by a processor, cause a device to perform the operations of the method of determining channel coefficients characterizing a channel associated with a multipath signal.

Other principal features and advantages of the invention will become apparent to those skilled in the art upon review of the following drawings, the detailed description, and the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

Illustrative embodiments of the invention will hereafter be described with reference to the accompanying drawings, wherein like numerals denote like elements.

FIG. 1 shows a system in a scattering environment in accordance with an illustrative embodiment.

FIG. 2 shows a block diagram of a transceiver device of the system of FIG. 1 in accordance with an illustrative embodiment.

FIG. 3 depicts a flow diagram illustrating exemplary operations performed by the transceiver device of FIG. 2 in accordance with an illustrative embodiment.

FIG. 4 shows a schematic illustrating a virtual representation of a single-antenna, frequency-selective channel in accordance with an illustrative embodiment.

FIG. 5 a shows example results derived using a least squares estimation method in accordance with an illustrative embodiment.

FIG. 5 b shows example results derived using a lasso estimation method in accordance with an illustrative embodiment.

FIG. 6 shows a schematic illustrating a virtual representation of a single-antenna, doubly-selective channel in accordance with an illustrative embodiment.

FIG. 7 shows a schematic illustrating a virtual representation of an angle-delay-Doppler channel in accordance with an illustrative embodiment.

DETAILED DESCRIPTION

With reference to FIG. 1, a system 100 is shown in accordance with an illustrative embodiment. System 100 is located within a scattering environment 101 that may include, for example, a first scatterer 106 a and a second scatterer 106 b. There may be any number of scatterers in scattering environment 101 of the same or different types. Scatterers include any objects in the physical environment such as buildings, vehicles, vegetation, the terrain, weather, etc. capable of reflecting electromagnetic waves.

With reference to the illustrative embodiment of FIG. 1, system 100 is a communication system that may include a first transceiver device 102 and a second transceiver device 104. In an illustrative embodiment, first transceiver device 102 may include a base station of a wireless communication system and second transceiver device 104 may include a computer of any form factor, a personal data assistant, an instant messaging device, a phone, a radio, etc. In another illustrative embodiment, first transceiver device 102 may include a personal data assistant, a computer of any form factor, an instant messaging device, a phone, a radio, etc. In an alternative embodiment, system 100 may include first transceiver device 102 that is a sensor system, such as a radar or a sonar, to detect targets of various types within scattering environment 101.

With reference to the illustrative embodiment of FIG. 1, a wireless signal 108 transmitted from first transceiver device 102 to second transceiver device 104 is received at second transceiver device 104 as a delayed, attenuated, and, if either or both of first transceiver device 102 and second transceiver device 104 are moving, a Doppler shifted version of wireless signal 108. Wireless signal 108 also may be reflected and scattered by first scatterer 106 a resulting in a second wireless signal 110 being received at second transceiver device 104. Second wireless signal 110 also is a delayed, attenuated, and possibly Doppler shifted version of wireless signal 108. Wireless signal 108 also may be reflected and scattered by second scatterer 106 b resulting in a third wireless signal 112 being received at second transceiver device 104. Third wireless signal 112 also is a delayed, attenuated, and possibly Doppler shifted version of wireless signal 108. Wireless signal 108 also may be reflected and scattered by second scatterer 106 b resulting in a fourth wireless signal 114 being received at first transceiver device 102. Fourth wireless signal 114 also is a delayed, attenuated, and possibly Doppler shifted version of wireless signal 108.

Second wireless signal 110, fourth wireless signal 114, and third wireless signal 112 are multipath signals. Multipath signal propagation results in multiple spatially distributed receive paths. Multipath propagation leads to signal fading—fluctuations in received signal strength—that can severely impact reliable communication and sensing functions. On the other hand, multipath is also a source of diversity based on the multiple statistically independent communication paths that can increase the rate and reliability of the communication and sensing functions. The impact of multipath fading versus diversity on performance depends on the amount of channel state information (CSI) available to the system. For example, knowledge of instantaneous CSI at the receiving device for coherent reception enables exploitation of diversity to combat fading. Additionally, gains in capacity and reliability are possible if even partial CSI is available at the transmitting device as well.

The statistical characteristics of a wireless channel or sensing environment depend on the interaction between scattering environment 101 and the signal space of first transceiver device 102 and second transceiver device 104. Signal space parameters include bandwidth (i.e. narrowband, wideband), the number of transceiver antennas, the antenna spacing, pulse duration, frequency, etc. Accurate channel modeling and characterization in time, frequency, and space, as a function of multipath and signal space characteristics enables exploitation of technological advances including frequency and bandwidth agility and reconfigurable antenna arrays and support coherent processing.

With reference to FIG. 2, a block diagram of first transceiver device 102 is shown in accordance with an illustrative embodiment. First transceiver device 102 may include an antenna 200, a transceiver 202, a processor 204, a computer-readable medium 206, and a channel estimation application 208. Second transceiver device 104 may include similar components. In another illustrative embodiment, first transceiver device 102 and/or second transceiver device 104 may include a separate transmitter and receiver. First transceiver device 102, of course, may include different and additional components such as a signal generator, a signal processor, etc. not explicitly shown in FIG. 2. First transceiver device 102 may include a plurality of antennas arranged in an array. The number and type of antennas of first transceiver device 102 may be different from the number and type of antennas of second transceiver device 104. The plurality of antennas may be arranged to form a uniform or a non-uniform linear array, a rectangular array, a circular array, a conformal array, etc. An antenna of the plurality of antennas may be a dipole antenna, a monopole antenna, a helical antenna, a microstrip antenna, a patch antenna, a fractal antenna, etc. The plurality of antennas may be reconfigurable spatially such that an antenna spacing between the plurality of antennas can be adjusted. Antenna 200 may be steerable.

Transceiver 202 processes electromagnetic signals received by antenna 200 and to be transmitted by antenna 200 under control of processor 204. First transceiver device 102 and/or second transceiver device 104 may include a plurality of transceivers that use the same or a different transmission/reception technology.

Processor 204 executes computer-readable instructions as known to those skilled in the art. The computer-readable instructions may be carried out by a special purpose computer, logic circuits, or hardware circuits. Thus, processor 204 may be implemented in hardware, firmware, software, or any combination of these methods. The term “execution” is the process of running an application or the carrying out of the operation called for by a computer-readable instruction. The computer-readable instructions may be written using one or more programming language, scripting language, assembly language, etc. Processor 204 executes a computer-readable instruction, meaning that it performs the operations called for by that computer-readable instruction. Processor 204 operably couples with transceiver 202 and computer-readable medium 206 to receive, to send, and to process information and/or to control the operations of first transceiver device 102. Processor 204 may retrieve a set of computer-readable instructions from a permanent memory device such as a read only memory device (ROM) and copy the instructions in an executable form to a temporary memory device that is generally some form of random access memory (RAM). First transceiver device 102 and/or second transceiver device 104 may include a plurality of processors that use the same or a different processing technology.

Computer-readable medium 206 is an electronic holding place or storage for information so that the information can be accessed by processor 204 as known to those skilled in the art. Computer-readable medium 206 can include, but is not limited to, any type of RAM, any type of ROM, any type of flash memory, etc. such as magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips, . . . ), optical disks (e.g., compact disk (CD), digital versatile disk (DVD), . . . ), smart cards, flash memory devices, etc. First transceiver device 102 and/or second transceiver device 104 may have one or more computer-readable media that use the same or a different memory media technology. First transceiver device 102 and/or second transceiver device 104 also may have one or more drives that support the loading of a memory media such as a CD, a DVD, a flash memory card, etc.

Channel estimation application 208 includes operations which estimate and/or characterize the channel state within scattering environment 101 based on the signal space characteristics. The operations may be implemented using hardware, firmware, software, or any combination of these methods. With reference to the illustrative embodiment of FIG. 2, channel estimation application 208 is implemented in software, i.e. computer-readable instructions, stored in computer-readable medium 206 and accessible by processor 204 for execution of the computer-readable instructions that embody the operations of channel estimation application 208. The computer-readable instructions of channel estimation application 208 may be written using one or more programming languages, assembly languages, scripting languages, etc. The functionality provided by channel estimation application 208 may be distributed among one or more modules and across one or more devices. In an illustrative embodiment, first transceiver device 102 and/or second transceiver device 104 may characterize the channel state and send the channel state information back from the receiver to the transmitter to enable transceiver adaptation for enhanced spectral efficiency and interference management. For example, the channel state may be characterized by channel coefficients.

With reference to FIG. 3, illustrative operations associated with channel estimation application 208 of FIG. 2 are described. Additional, fewer, or different operations may be performed, depending on the embodiment. The order of presentation of the operations of FIG. 3 is not intended to be limiting. In an operation 300, a training signal is determined. In an operation 302, the determined training signal is transmitted using transceiver 202 and antenna 200. In an operation 304, a multipath signal is received. Depending on the embodiment, the training signal determination and transmission and the multipath signal reception may be performed at the same transceiver device. For example, if the transceiver device is associated with a radar or a sonar system. In an alternative embodiment, the training signal determination and transmission may be performed at first transceiver device 102 while the multipath signal reception may be performed at second transceiver device 104 or vice versa. In an illustrative embodiment, the training signal is determined at the transceiver device receiving the multipath signal as part of signaling from the transmitting transceiver device, an a priori determination as part of the system configuration, etc. so that the training signal is known at the transceiver device receiving the multipath signal and can thus be determined. In an illustrative embodiment, the training signal may not change once determined. In another illustrative embodiment, the training signal may be dynamically determined based, for example, on scattering environment 101 and/or on the current signal space characteristics for a given communication or sensing function.

In an operation 306, the received multipath signal is sampled. For example, the received multipath signal may be sampled in time, i.e. chip-rate sampling, projected onto a receive side signaling basis functions, i.e. multitone waveforms, to yield a discrete version of the received multipath signal, etc. In an operation 308, channel coefficients are determined based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process. As used herein, a mixed-norm convex optimization process is a mathematical process for optimization of a convex objective function, possibly subject to convex equality and convex inequality constraints, such that the entire optimization setup (objective function and constraints, if they exist) contain at least two different vector norms, for example, l₂ and l₁ norms, l₁ and l_(∞) norms, etc. In an illustrative embodiment, the mixed-norm convex optimization process is a Dantzig selector or a Lasso estimator. In an operation 310, a determination is made concerning whether or not to repeat the channel estimation process. For example, the channel estimation process may be repeated periodically, for each reception, at an initiation of a communication link, with a change in signaling parameters such as a frequency, bandwidth, or antenna spacing change, etc.

Illustrative channel estimation processes based on different signal space characteristics are described with additional detail below. A channel model is formed, a training signal is selected, and an estimator is applied for each example process.

In a first illustrative embodiment, first transceiver device 102 and second transceiver device 104 include single antennas and the channel is identified as frequency-selective because the channel impulse response remains constant over the time duration of interest and the channel maximum delay spread T_(m) is large relative to the inverse of the communication bandwidth W, such that T_(m)W≧1. A “channel model” is a discrete approximation of the continuous time channel at the delay resolution dictated by the channel signaling parameters. The channel model captures the relationship between the clustering of physical paths and the sparsity of dominant channel coefficients. The complex baseband transmitted and received signals can be related as

$\begin{matrix} {{y(t)} = {{\int_{0}^{T_{m}}{{h(\tau)}{x\left( {t - \tau} \right)}{\mathbb{d}\tau}}} + {z(t)}}} & (1) \end{matrix}$ where h(τ) is the channel impulse response, x(t), y(t), and z(t) represent the transmitted, the received, and the additive white Gaussian noise (AWGN) waveforms, respectively.

Frequency-selective channels generate multiple delayed and attenuated copies of the transmitted waveform. For such “multipath” channels, h(τ) can be modeled as

$\begin{matrix} {{h(\tau)} = {\sum\limits_{i = 1}^{N_{p}}{\alpha_{i}{\delta\left( {\tau - \tau_{i}} \right)}}}} & (2) \end{matrix}$ and the transmitted and received waveforms related by

$\begin{matrix} {{y(t)} = {{\sum\limits_{i = 1}^{N_{p}}{\alpha_{i}{x\left( {t - \tau_{i}} \right)}}} + {z(t)}}} & (3) \end{matrix}$ which corresponds to signal propagation along N_(p) physical paths, where α_(i)εC and τ_(i)ε[0, T_(m)] are the complex path gain and the delay associated with the i-th physical path, respectively.

The discrete path model of equation (2), while realistic, is difficult to analyze and identify due to nonlinear dependence on the real valued delay parameters {τ_(i)}. However, because the communication bandwidth W is limited, the continuous-time channel can be accurately approximated by a channel model with the aid of sampling theorems and/or power series expansions. The channel model provides a discrete approximation of frequency-selective channels by uniformly sampling the physical multipath environment in delay at a resolution commensurate with W, i.e.,

$\begin{matrix} {{y(t)} \approx {{\sum\limits_{i = 0}^{p - 1}{\beta_{j}{x\left( {t - {j/W}} \right)}}} + {z(t)}}} & (4) \\ {\beta_{j} \approx {\sum\limits_{i \in S_{\tau,j}}{\alpha_{i}\sin\;{c\left( {j - {W\;\tau_{i}}} \right)}}}} & (5) \end{matrix}$ where p=┌T_(m)W┐+1, sinc(a)=sin(πa)/πa, and S_(τ,j)={i:τ_(i)ε[j/W−½W,j/W+½W]}denotes the set of all physical paths whose delays lie within the delay resolution bin of width Δτ=1/W centered around the j-th resolvable virtual delay, {circumflex over (τ)}_(j)=j/W·{β_(j)}are termed as the channel coefficients in the delay space.

With reference to FIG. 4, a plurality of resolution bins 400 having a resolution of 1/W are shown for a time window [0, T_(m)]. The plurality of vertical arrows 402 indicate gains received from different paths at a delay τ. Equation (5) states that the coefficient β_(j) for each of the plurality of resolution bins 400 is approximately the sum of the gains of all paths within the j-th delay resolution bin obtained at the center of each of the plurality of resolution bins 400. The accuracy of the approximation increases with the bandwidth W due to the resulting increase in delay resolution.

Based on the interarrival times between different multipath clusters within the delay spread, channels can be categorized as either “rich” or “sparse”. In a rich multipath channel, the interarrival times are smaller than the inverse of the communication bandwidth W. Sparse multipath channels, on the other hand, exhibit interarrival times that are larger than 1/W, for example as shown in FIG. 4, where not every resolution bin contains a multipath component. In particular, since a channel coefficient consists of the sum of the gains of all paths falling within its respective delay bin, sparse frequency-selective channels tend to have far fewer nonzero channel coefficients than the number of the plurality of resolution bins 400 at any fixed, but large enough bandwidth. Thus, the multipath channel may be considered sparse if the number of nonzero channel coefficients is less than the number of resolvable paths p that is p=┌T_(m)W┐+1.

The continuous-time received signal y(t) can be chip-rate sampled at a rate of 1/W at the receiver to obtain an equivalent discrete time representation of equation (4) as y=x*β+z

y=Xβ+z  (6) where * denotes the discrete convolution operator, βεC^(p) is the vector of channel coefficients, and x, y, and z are the vectors of samples of x(t), y(t), and z(t), respectively. The dimensions of x, y, and z are dictated by the input signaling duration T_(s), where x(t)=0 for all t∉[0,T_(s)]. n(=┌T_(s)W┐) denotes the number of nonzero samples of x(t), resulting in xεC^(n) and y,z εC^(n+p−1). The matrix X is an (n+p−1)×p Toeplitz-structured, convolution matrix formed from vector x.

In an illustrative embodiment, β is modeled as a deterministic, but unknown vector. A power constraint also may be applied on the transmitted signal x(t) that can be readily translated into an average power constraint on the entries of x. Without loss of generality, it can be assumed that max_(k) E[|x_(k)|²]≦1 and that the entries of z correspond to an independent and identically distributed (iid) complex Gaussian white noise sequence.

The virtual representation of a frequency-selective channel captures its essential characteristics in terms of the channel coefficients {β_(j)}, the determined (selected) training signal x, and the received multipath signal y. An estimator {circumflex over (β)}_(CS) of the sparse channel can be formed by solving either an

penalized least squares problem using the “lasso” estimator, as described in R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Roy. Statist Soc. Ser. B, pp. 267-288, 1996 (hereinafter referred to as the lasso estimator), or a linear program called the “Dantzig selector” as described in E. Candés and T. Tao, “The Dantzig selector: Statistical estimation when p is much larger than n,” Ann. Statist, pp. 2313-2351, December 2007 (hereinafter referred to as the Dantzig selector).

As a first illustrative training signal used in a frequency-selective channel, a multi-carrier signal comprising an OFDM basis for the N₀-dimensional signal space is generated via frequency shifts of a fixed prototype pulse can be used of the form g(t):γ_(k)(t)=g(t)e ^(j2πkt/T) ,kεS={0, 1, . . . , N ₀−1}  (7) where N₀=TW. In an illustrative embodiment, the pulse is assumed to have unit energy, ∫|g(t)|²dt=1. The training waveform may randomly dedicate N_(r) of the N₀ basis elements as “pilot tones” such that

${{x(t)} = {\sqrt{\frac{ɛ}{N_{r}}}{\sum\limits_{m \in S_{r}}{\gamma_{m}(t)}}}},{0 \leq t < T}$ where the set of indices of pilot tones, S_(r) consists of N_(r) elements randomly selected from S and ε is the transmit energy budget available for training purposes. At the receiver, projecting the (noisy) received signal y(t) onto the OFDM basis waveforms yields

${y_{m} = {{\left\langle {y,\gamma_{m}} \right\rangle \approx {{\sqrt{\frac{ɛ}{N_{r}}}H_{m}} + {z_{m}m}}} \in S_{r}}}\mspace{14mu}$ ${{{where}\mspace{14mu}\left\langle {y,\gamma_{m}} \right\rangle} = {\int{{y(t)}\overset{\_}{\gamma_{m}(t)}{\mathbb{d}t}}}},\left\{ z_{m} \right\}$ corresponds to an AWGN sequence and the channel coefficients are given by H_(m)≈H(f) f|_(f=m/T).

The virtual representation implies that

${H(f)} \approx {\sum\limits_{l = 0}^{p - 1}{h_{l}{{\mathbb{e}}^{{- {j2\pi}}\frac{l}{W}f}.}}}$ As a result, the OFDM channel coefficients H_(m) can be written as

$H_{m} = {{\sum\limits_{l = 0}^{p - 1}{h_{l}{\mathbb{e}}^{{- j}\; 2\pi\frac{l}{N_{0}}m}}} = {u_{f,m}^{T}h}}$ where h is the p-dimensional vector of channel coefficients,

u_(f, m) = [1  ω_(N₀)^(1m)  …  ω_(N₀)^((L − 1)m)]^(T) ∈ C^(L)   where ${\omega_{N_{0}} = {{{\mathbb{e}}^{{- j}\frac{2\pi}{N_{o}}}\mspace{14mu}{and}\mspace{14mu} n} = 0}},1,\ldots\mspace{14mu},{N_{0} - 1.}$ y=Xh+z where the N_(r) sensing matrix X is comprised of {√{square root over (ε|N_(r))}u_(f,m) ^(T):mεS_(r)} as its rows and the AWGN vector z is distributed as CN(0_(N) _(r) ,I_(N) _(r) ).

The virtual model channel coefficients can be determined as a solution to the Dantzig selector as

$\begin{matrix} {\hat{\beta} = {{\underset{\overset{\sim}{\beta} \in C^{p}}{argmin}{\overset{\sim}{\beta}}_{l_{1}}\mspace{14mu}{subject}\mspace{14mu}{to}\mspace{14mu}{{X^{H}r}}_{l_{\infty}}} \leq \lambda}} & (8) \end{matrix}$ where {circumflex over (β)} are the estimated channel coefficients, ∥∥_(l) ₁ is an

norm, ∥∥_(l) _(∞) is an

norm, p a maximum number of channel coefficients, C^(p) is a p-dimensional complex space, X is the sensing matrix {√{square root over (ε/N_(r))}u_(f,m) ^(T): mεS_(r)}, r is the N_(r) dimensional vector of residuals: r=y−X{tilde over (h)}, y is the sampled multipath signal, and λis a tuning parameter selected to control a number of channel coefficients to be determined. In an illustrative embodiment, λ(p,ε)=√{square root over (2ε(1+a)log p)} where ε is a transmit energy budget for the training signal and any a≧0. In a non-sparse environment, the same method can be used to determine the first const·N_(r)/log⁴ N₀ largest channel coefficients. In another illustrative embodiment, a lasso estimator also may be used to determine the channel model coefficients.

As a second illustrative training signal used in a frequency-selective channel, a pseudo-random sequence {x_(k)}_(k=0) ^(n−1), where n is the input probe duration and the x_(k)'s are iid realizations from a zero mean, unit variance distribution f(x). In an illustrative embodiment, {x_(k)}_(k=0) ^(n−1) is a sequence of IID random variables drawn from a Rademacher distribution where n≧c₁·log p·S² where is any constant c₁≧0, S is the number of desired coefficients to recover. The virtual model channel coefficients can be determined as a solution to the Dantzig selector as in equation (9), where the entries of {circumflex over (β)} are the estimated channel coefficients, ∥ ∥_(l) ₁ is an

norm, ∥∥_(l) _(∞) is an

norm, p is a maximum number of channel coefficients, C^(p) is a p-dimensional complex space, X is a sensing matrix, r=y−X{tilde over (β)} is a vector of residuals, y is the sampled multipath signal, and λ is a tuning parameter selected to control a number of channel coefficients to be determined. Based on the first illustrative training signal, p=┌T_(m)W┐+1 is the maximum number of nonzero channel coefficients, X is the (n+p−1)×p Toeplitz-structured, convolution matrix formed from the first illustrative training signal, n is the input probe duration, r is an (n+p−1)-dimensional vector of residuals, and λ can be chosen as √{square root over (2(1+a)log p)}·σ for any a≧0, and σ is a square root of the noise power. In an alternative embodiment, the lasso estimator can be used to determine the virtual model channel coefficients. In a non-sparse environment, the same method can be used to determine the first (n+p−1) largest channel coefficients.

With reference to FIGS. 5 a and 5 b, a comparison between use of a least squares estimator and use of a lasso estimator to determine the channel coefficients is shown. A training signal comprising an n=128 pseudo-random input probe to sense a p=128 length channel that has only ten channel coefficients 500 which were nonzero was used and are indicated as impulses in FIGS. 5 a and 5 b. The output of the channel was observed at a signal-to-noise ratio of −10 dB. Channel coefficients can be obtained by solving the least squares problem or a variant of it as {circumflex over (β)}_(LS)=(X ^(H) X)⁻¹ X ^(H) y.  (10)

The least squares estimates were obtained by pseudo-inverting the matrix X as in equation (10). The lasso estimates were obtained by executing a gradient projection for sparse reconstruction as described in Figueiredo, et al., “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE J. Select. Topics Signal Processing, pp. 586-597, December 2007. The results using the least squares estimator are shown in FIG. 5 a. The results using the lasso estimator are shown in FIG. 5 b. Using the lasso estimator, every nonzero channel coefficient 500 was identified and only one noise-only coefficient 502 was identified. In contrast, with reference to FIG. 5 a, even a clairvoyantly thresholded least squares estimator would be unable to identify all of the nonzero channel coefficients 500 without also identifying a significant number of noise-only coefficients.

In a second illustrative embodiment, first transceiver device 102 and second transceiver device 104 include single antennas and the channel is identified as doubly-selective because the delay spread and Doppler spread of the channel are large relative to the inverse of the signaling bandwidth and duration, respectively, i.e., Wτ_(max)≧1 and Tν_(max)≧1. W is the two-sided bandwidth. τ_(max) is the delay spread of the channel and is defined as the maximum possible nonzero delay introduced by the channel. T is the packet duration. ν_(max) is the maximum possible (one-sided) Doppler shift caused by the channel. In the second illustrative embodiment, the channel includes underspread channels, characterized by τ_(max)ν_(max)<<1, and there is no interpacket interference in time and/or frequency, such that T>>τ_(max) and W>>ν_(max). The dimension of the receiver signal space is N₀≈TW, the time-bandwidth product.

The complex baseband transmitted and received signals in the absence of noise can be related as

$\begin{matrix} \begin{matrix} {{y(t)} = {\int_{0}^{\tau_{\max}}{{h\left( {t,\tau} \right)}{x\left( {t - \tau} \right)}{\mathbb{d}\tau}}}} \\ {= {\int{{H\left( {t,f} \right)}{X(f)}{\mathbb{e}}^{{j2\pi}\;{ft}}{\mathbb{d}f}}}} \\ {= {\int_{0}^{\tau_{\max}}{\int_{- V_{\max/2}}^{V_{\max/2}}{{C\left( {v,\tau} \right)}{x\left( {t - \tau} \right)}{\mathbb{e}}^{j\; 2\pi\;{vt}}{\mathbb{d}v}{\mathbb{d}\tau}}}}} \end{matrix} & (11) \end{matrix}$ where x(t) and y(t) represent the transmitted and received waveforms, respectively, and X(f) is the Fourier transform of x(t). The channel is characterized by the time-varying impulse response, h(t,τ), or the time-varying frequency response, H(t,f), or the delay-Doppler spreading function, C(ν,τ) which are all three equivalent channel characterizations related to each other via Fourier transforms.

Doubly-selective channels generate multiple delayed, Doppler-shifted, and attenuated copies of the transmitted waveform. A discrete path model may be used to capture the characteristics of doubly-selective channels in terms of the physical propagation paths. In the discrete path model, the delay-Doppler spreading function of the channel can be expressed as

$\begin{matrix} {{C\left( {v,\tau} \right)} = {\sum\limits_{i = 1}^{N_{p}}{\alpha_{i}{\delta\left( {v - v_{i}} \right)}{\delta\left( {\tau - \tau_{i}} \right)}}}} & (12) \end{matrix}$ and the transmitted and received waveforms related by

$\begin{matrix} {{y(t)} = {\sum\limits_{i = 1}^{N_{p}}{\alpha_{i}{\mathbb{e}}^{{j2\pi}\; v_{i}t}{x\left( {t - \tau_{i}} \right)}}}} & (13) \end{matrix}$ which corresponds to signal propagation along N_(p) physical paths, where α_(i)εC, ν_(i)ε[−ν_(max)/2,ν_(max)/2], and τ_(i)ε[0,τ_(max)] are the complex path gain, the Doppler shift, and the delay associated with the i-th physical path, respectively.

Though realistic, equation (13) is difficult to analyze and learn due to its nonlinear dependence on a potentially large number of physical parameters α_(i),ν_(i),τ_(i). However, because of the finite signaling duration and bandwidth, the discrete path model can be accurately approximated by the channel model with the aid of sampling theorems and/or power series expansions. The channel model provides a low dimensional approximation of the discrete path model by uniformly sampling the physical multipath environment in the delay-Doppler domain at a resolution commensurate with W and T (Δτ=1/W, Δν=1/T ). That is,

$\begin{matrix} {{y(t)} \approx {\sum\limits_{l = 0}^{L - 1}{\sum\limits_{k = {- K}}^{K}{h_{l,k}{\mathbb{e}}^{{j2\pi}\frac{k}{T}t}{x\left( {t - {l/W}} \right)}}}}} & (14) \\ {h_{l,k} \approx {\sum\limits_{i \in {S_{\tau,l}\bigcap S_{v,k}}}{\alpha_{i}{\mathbb{e}}^{- {{j\pi}{({k - {Tv}_{i}})}}}\sin\;{c\left( {k - {Tv}_{i}} \right)}\sin\;{c\left( {l - {W\;\tau_{i}}} \right)}}}} & (15) \end{matrix}$ where sinc(a)=sin(πa)/πa and L=┌Wτ_(max)┐+1 and K=┌Tν_(max)/2 denote the maximum number of resolvable delays and one-sided, Doppler shifts within the delay-Doppler spreading function, respectively. The set S_(τ,l)={i:τ_(i)ε[

/W−½W,l/W+½W)]} is the set of indices of all paths whose delays lie within the delay resolution bin of width Δτ=1/W centered around the l-th virtual delay, {circumflex over (τ)}_(l)=

/W, while S_(V,K)={i:ν_(i)ε[k/T−½T,k/T+½T)]} denotes the set of indices of all paths whose Doppler shifts lie within the Doppler resolution bin of width Δν=1/T centered around the k-th virtual Doppler shift, {circumflex over (ν)}_(k)=k/T The parameters h_(l,k) are identified as the channel coefficients in the delay-Doppler domain. Equation (15) states that the channel coefficient h_(l,k) approximately consist of the sum of the gains of all paths whose delays and Doppler shifts lie within the (l, k)-th delay-Doppler resolution bin of size Δτ×Δν centered around the sampling point ({circumflex over (τ)}_(l),{circumflex over (ν)}_(k))=(

/W,k/T) in the delay-Doppler domain, as illustrated in FIG. 6. In essence, the virtual representation of equation (14) effectively approximates a discrete path doubly-selective channel in terms of an N-dimensional parameter comprised of the channel coefficients h_(l,k), where N=L×(2K+1)=(┌Wτ_(max)┐+1)·(2┌Tν_(max)/2┐+1)≈τ_(max)ν_(max)N₀.

With reference to FIG. 6, a plurality of resolution bins 600 having a resolution of 1/W in the delay domain space, and 1/T in the Doppler spread domain space are shown for a time window [0, τ_(max)]. The plurality of dots 602 indicate gains received from different paths at a delay τ and Doppler shift ν.

Based on the interspacings between the multipath clusters within the delay-Doppler domain, doubly-selective channels can be characterized as either “rich” or “sparse”. In a rich multipath channel, the interspacings are smaller than Δτ=1/W in delay and Δν=1/T in Doppler shift. Sparse multipath channels, on the other hand, exhibit interspacings that are larger than Δτ and/or Δν, for example, as shown in FIG. 6, where not every resolution bin contains a multipath component or “dot” indicating a multipath component. In particular, since a channel coefficient consists of the sum of the gains of all paths falling within its respective delay-Doppler resolution bin, sparse doubly-selective channels tend to have far fewer than N nonzero channel coefficients at any fixed, but large enough signaling duration and/or bandwidth. Thus, the doubly selective channel may be considered sparse if D<<N where D=|{(

k):h_(l,k)>0}| and N=L×(2K+1)≈τ_(max)ν_(max)N₀ is the total number of resolvable delays and Doppler shifts (channel coefficients) within the delay-Doppler spread.

As a first illustrative training signal used in a doubly-selective channel, a single-carrier spread spectrum waveform corresponding to a particular spreading code with binary phase shift keying as the modulation scheme can be used. The resulting training waveform x(t) can be represented as

$\begin{matrix} {{{x(t)} = {\sum\limits_{n = 0}^{N_{0} - 1}{x_{n}{I_{\lbrack{0,T_{c}})}\left( {t - {nT}_{C}} \right)}}}},{0 \leq t < T}} & (16) \end{matrix}$ where I_([0,T) _(c) ₎(t) is the chip waveform, T_(c)≈1/W is the chip duration, and {x_(n)ε

is the spreading code corresponding to the training signal waveform. The output of the channel corresponding to x(t) is given by

$\begin{matrix} {{y(t)} \approx {{\sum\limits_{l = 0}^{L - 1}{\sum\limits_{k = {- K}}^{K}{h_{l,k}{\mathbb{e}}^{{j2\pi}\frac{k}{T}t}{x\left( {t - {l/W}} \right)}}}} + {{z(t)}\mspace{14mu} 0}} \leq t < {T + \tau_{\max}}} & (17) \end{matrix}$ where z(t) is a zero-mean, circularly symmetric, complex AWGN waveform. For spread spectrum waveforms, chip-rate sampling of y(t) at the receiver yields an equivalent discrete-time representation

$\begin{matrix} {{y_{n} = {{\sum\limits_{l = 0}^{L - 1}{\sum\limits_{k = {- K}}^{K}{h_{l,k}{\mathbb{e}}^{{j2\pi}\frac{k}{N_{0}}n}x_{n - l}}}} + z_{n}}},{n = 0},1,\ldots\mspace{14mu},{N_{0} + L - 2}} & (18) \end{matrix}$ where {z_(n)} corresponds to a zero-mean, circularly symmetric, complex AWGN sequence and N₀≈TW is the dimension of the receiver signal space.

If Ñ₀=N₀+L−1 and an Ñ₀-length sequence of vectors {x_(n)εC^(L)} is defined comprising the spreading code {x_(n)} as x_(n)=[x_(n) x_(n−1) . . . x_(n−(L−1))] for n=0, 1, . . . , Ñ₀−1 where the notational understanding is that x_(i)=0 for i∉{0, 1, . . . N₀−1}, and if

$\begin{matrix} {H = \begin{bmatrix} h_{0,{- K}} & h_{0,{{- K} + 1}} & \ldots & h_{0,K} \\ h_{1,{- K}} & h_{1,{{- K} + 1}} & \ldots & h_{1,K} \\ \vdots & \vdots & \ldots & \vdots \\ h_{{L - 1},{- K}} & h_{{L - 1},{{- K} + 1}} & \ldots & h_{{L - 1},K} \end{bmatrix}} & (19) \end{matrix}$ is the L×(2K+1) matrix of channel coefficients, and {u_(n)εC^(2K+1)} is an Ñ₀-length sequence of phase vectors given by u _(n)=[ω_(N) ₀ ^(Kn)ω_(N) ₀ ^((K−1)n) . . . ω_(N) ₀ ^(−Kn)]^(T)  (20) where

$\omega_{N_{0}} = {\mathbb{e}}^{{- j}\frac{2\pi}{N_{o}}}$ and n=0, 1, . . . , Ñ₀−1, the sequence {y_(n)} in equation (18) can be written as

$\begin{matrix} \begin{matrix} {y_{n} = {{x_{n}^{T}{Hu}_{n}} + z_{n}}} \\ {= {{\left( {u_{n}^{T} \otimes x_{n}^{T}} \right){{vec}(H)}} + z_{n}}} \\ {{= {{\left( {u_{n}^{T} \otimes x_{n}^{T}} \right)h} + z_{n}}},{n = 0},1,\ldots\mspace{14mu},{{\overset{\sim}{N}}_{o} - 1}} \end{matrix} & (21) \end{matrix}$

If h=vec(H)εC^(N) is the vector of channel coefficients, and the y_(n)'s are stacked into an Ñ₀ dimensional vector y, the following system of equations results y=Xh+z  (22) where the Ñ₀×N sensing matrix X is comprised of {u_(n) ^(T)

x_(n) ^(T)} as its rows: X=└u₀

x₀ . . . u_(Ñ) ₀ ⁻¹

x_(Ñ) ₀ ⁻¹┘^(T). In an illustrative embodiment, the spreading code {x_(n)} is generated from a Rademacher distribution, i.e., the x_(n)'s independently take values of √{square root over (ε/N₀)} or −√{square root over (ε/N₀)} with probability of 0.5 each where ε is a transmit energy budget for the training signal.

The channel model coefficients can be determined as a solution to the selector

$\begin{matrix} {\hat{h} = {{\underset{\overset{\sim}{h} \in C^{N}}{argmin}{\overset{\sim}{h}}_{l\; 1}\mspace{14mu}{subject}\mspace{14mu}{to}\mspace{14mu}{{X^{H}r}}_{l_{\infty}}} \leq \lambda}} & (23) \end{matrix}$ where ĥ are the estimated channel coefficients, ∥∥_(l) ₁ is an

norm, ∥∥_(l) _(∞) is an l_(∞) norm, N=L×(2K+1)=(┌Wτ_(max)┐+1)·(2┌Tν_(max)/2┐+1)≈τ_(max)ν_(max)N₀ a maximum number of non-zero channel coefficients, C^(N) is a set of non-zero channel coefficients, X is the sensing matrix X=└u₀

x₀ . . . u_(Ñ) ₀ ⁻¹

x_(Ñ) ₀ ⁻¹┘^(T), r is the Ñ₀ dimensional vector of residuals: r=y−X{tilde over (h)}, y is the sampled multipath signal, and λ is a tuning parameter selected to control a number of channel coefficients to be determined. In an illustrative embodiment, λ(N,ε)=√{square root over (2ε(1+a)log N)} where εis a transmit energy budget for the training signal and any a≧0. In another illustrative embodiment, a lasso estimator may be used to determine the channel model coefficients. In a non-sparse environment, the same method can be used to determine the first S=const·√{square root over (N₀/log p)} largest channel coefficients.

As a second illustrative training signal used in a doubly-selective channel, a multi-carrier signal comprising a complete orthogonal short-time Fourier (STF) basis for the N₀-dimensional signal space is generated via time and frequency shifts of a fixed prototype pulse g(t):γ_(l,k)(t)=g(t−lT_(o))e^(j2πkW) ^(o) ^(t),(l,k)εS={0, 1, . . . , N_(t)−1}×{0,1, . . . , N_(f)−1} where N_(t)=T/T₀ and N_(f)=W/W₀. In an illustrative embodiment, the prototype pulse is assumed to have unit energy, ∫|g(t)|²dt=1, and completeness of {γ_(l,k)} stems from the underlying assumption that T₀W₀=1, which results in a total of N_(t)N_(f)=TW/T₀W₀=N₀ basis elements. The training waveform may randomly dedicate N_(r) of the N₀ STF basis elements as “pilot tones” such that

$\begin{matrix} {{{x(t)} = {\sqrt{\frac{ɛ}{N_{r}}}{\sum\limits_{{({n,m})} \in S_{r}}{\gamma_{n,m}(t)}}}},{0 \leq t < T}} & (24) \end{matrix}$ where the set of indices of pilot tones, S_(r) consists of N_(r) elements randomly selected from S and ε is the transmit energy budget available for training purposes. At the receiver, assuming that the basis parameters T₀ and W₀ are matched to the channel parameters τ_(max) and ν_(max) so that γ_(l,k)'s serve as approximate eigenfunctions for sufficiently underspread channels, projecting the (noisy) received signal y(t) onto the STF basis waveforms yields

$\begin{matrix} {y_{n,m} = {{\left\langle {y,\gamma_{n,m}} \right\rangle \approx {{\sqrt{\frac{ɛ}{N_{r}}}H_{n,m}} + {z_{n,m}\mspace{14mu}\left( {n,m} \right)}}} \in S_{r}}} & (25) \end{matrix}$ where

y, γ_(n,m)

=∫y(t)γ_(n,m)(t)dt, {z_(n,m)} corresponds to an AWGN sequence and the STF channel coefficients are given by H_(n,m)≈H(t,f)|_((t,f)=(nT) ₀ _(,mW) ₀ ₎.

The virtual representation of a doubly-selective channel implies that

${H\left( {t,f} \right)} \approx {\sum\limits_{l = 0}^{L - 1}{\sum\limits_{k = {- K}}^{K}{h_{l,k}{\mathbb{e}}^{j\; 2\;\pi\frac{k}{T}t}{{\mathbb{e}}^{{- j}\; 2\;\pi\frac{l}{W}f}.}}}}$ As a result, the STF channel coefficients H_(n,m) can be written as

$\begin{matrix} \begin{matrix} {H_{n,m} = {\sum\limits_{l = 0}^{L - 1}{\sum\limits_{k = {- K}}^{K}{h_{l,k}{\mathbb{e}}^{j\; 2\;\pi\frac{k}{N_{t}}n}{\mathbb{e}}^{{- j}\; 2\;\pi\frac{l}{N_{f}}m}}}}} \\ {= {u_{f,m}^{\prime}{Hu}_{t,n}}} \\ {= {\left( {u_{t,n}^{\prime} \otimes u_{f,m}^{\prime}} \right){{vec}(H)}}} \\ {= {\left( {u_{t,n}^{\prime} \otimes u_{f,m}^{\prime}} \right)h}} \end{matrix} & (26) \end{matrix}$ where H is the L×(2K+1) matrix of channel coefficients as in equation (19), h=vec(H)εC^(N), u_(f,m)=[1 ω_(N) _(f) ^(1m) . . . ω_(N) _(f) ^((L−1)m)]^(T)εC^(L), and u_(t,n)=[ω_(N) _(t) ^(Kn) ω_(N) _(t) ^((K−1)n) . . . ω_(N) _(t) ^(−Kn)]^(T)εC^(2K+1). Stacking the received training symbols {y_(n,m)} into an N_(r)-dimensional vector y yields the following system of equations y=Xh+z  (27) where the N_(r)×N sensing matrix X is comprised of {√{square root over (ε/N_(r))}(u_(t,n) ^(T)

u_(f,m) ^(T)):(n,m)εS_(r)} as its rows and the AWGN vector z is distributed as CN(0_(N) _(r) , I_(N) _(r) ).

The channel model coefficients can be determined as a solution to the Dantzig selector as

$\begin{matrix} {\hat{h} = {{\underset{\overset{\sim}{h} \in C^{N}}{argmin}{\overset{\sim}{h}}_{l_{1}}\mspace{14mu}{subject}\mspace{14mu}{to}\mspace{14mu}{{X^{H}r}}_{l_{\infty}}} \leq \lambda}} & (28) \end{matrix}$ where ĥ are the estimated channel coefficients, ∥∥_(l) ₁ is an l₁ norm, ∥∥_(l) _(∞) is an l_(∞) norm, N=L×(2K+1)=(┌Wτ_(max)┐+1)·(2┌Tν_(max)/2┐+1)≈τ_(max)ν_(max)N₀ a maximum number of channel coefficients, C^(N) is a N-dimensional complex space, X is the sensing matrix {√{square root over (ε/N_(r))}(x_(t,n) ^(T)

x_(f,m) ^(T)):(n,m)εS_(r)}, r is the N_(r) dimensional vector of residuals: r=y−X{tilde over (h)}, y is the sampled multipath signal, and λ is a tuning parameter selected to control a number of channel coefficients to be determined. In an illustrative embodiment, λ(N,ε)=√{square root over (2ε(1+a)log N)} where ε is a transmit energy budget for the training signal and any a≧0. In a non-sparse environment, the same method can be used to determine the first S=const·N_(r)/log⁴N₀ largest channel coefficients. In another illustrative embodiment, a lasso estimator also may be used to determine the channel model coefficients.

In a third illustrative embodiment, first transceiver device 102 and second transceiver device 104 include uniform linear arrays of N_(T) transmit antennas and N_(R) receive antennas forming a multi-antenna (MIMO) channel. In the absence of noise, the corresponding baseband transmitted and received signal can be related as

$\begin{matrix} {{{y(t)} = {\int_{{- W}/2}^{W/2}{{H\left( {t,f} \right)}{X(f)}{\mathbb{e}}^{j\; 2\;\pi\; f\; t}\ {\mathbb{d}f}}}},{0 \leq t \leq T}} & (29) \end{matrix}$ where W is the two-sided bandwidth, T is the packet duration, y(t) is the N_(R) dimensional received signal, X(f) is the (element-wise) Fourier transform of the N_(T)-dimensional transmitted signal x(t), and H(t,f) is the N_(R)×N_(T) time-varying frequency response matrix of the channel. A MIMO channel can be accurately modeled in terms of the multiple spatially distributed physical paths as

$\begin{matrix} {{H\left( {t,f} \right)} = {\sum\limits_{n = 1}^{N_{p}}{\beta_{n}{a_{R}\left( \theta_{R,n} \right)}{a_{T}^{H}\left( \theta_{T,n} \right)}{\mathbb{e}}^{j\; 2\;\pi\; v_{n}t}{\mathbb{e}}^{{- j}\; 2\;\pi\; t_{n}f}}}} & (30) \end{matrix}$ which represents signal propagation over N_(p) paths. β_(n) denotes the complex path gain, θ_(R,n) the angle of arrival (AoA) at the receiver, θ_(T,n) the angle of departure (AoD) at the transmitter, τ_(n) the relative delay, and ν_(n) the Doppler shift associated with the n-th path. The N_(T)×1 vector a_(T)(θ_(T)) and the N_(R)×1 vector a_(R)(θ_(R)) denote the array steering and response vectors, respectively, for transmitting/receiving a signal in the direction θ_(T), θ_(R) and are periodic in θ with unit period where θ=d sin(φ)/λ, d is the antenna spacing, φ is the physical angle measured with respect to the array broadside, and λ is the wavelength of propagation.

While the physical model of equation (30) is highly accurate, it is difficult to analyze and learn due to its nonlinear dependence on a potentially large number of physical parameters. However, because of the finite transmit and receive array apertures, signaling duration, and bandwidth, the physical model can be well-approximated by a channel model with the aid of a Fourier series expansion. The channel model provides a low-dimensional approximation of equation (30) by uniformly sampling the multipath environment in the angle-delay-Doppler domain at a resolution commensurate with the signal space parameters: (Δθ_(R), Δθ_(T), Δτ, Δν)=(1/N_(R), 1/N_(T), 1/W, 1/T) That is,

$\begin{matrix} {{H\left( {t, f} \right)} \approx {\sum\limits_{i = 1}^{N_{R}}{\sum\limits_{k = 1}^{N_{T}}{\sum\limits_{l = 0}^{L - 1}{\sum\limits_{m = {- M}}^{M}{{H_{v}\left( {i, k, l, m} \right)}{a_{R}\left( \frac{i}{N_{R}} \right)}{a_{T}^{H}\left( \frac{k}{N_{T}} \right)}{\mathbb{e}}^{j\; 2\;\pi\frac{m}{T}t}{\mathbb{e}}^{j\; 2\;\pi\frac{l}{W}f}}}}}}} & (31) \\ {\mspace{79mu}{{H_{v}\left( {i,k,l,m} \right)} \approx {\sum\limits_{n \in {S_{R,i}\bigcap S_{T,k}\bigcap S_{\tau,l}\bigcap S_{v,m}}}\beta_{n}}}} & (32) \end{matrix}$ where a phase and an attenuation factor have been absorbed in the β_(n)'s in equation (32). In equation (31), N_(R), N_(T), L=┌Wτ_(max)┐+1 and M=┌Tν_(max)/2┐ denote the maximum number of resolvable AoAs, AoDs, delays, and one-sided Doppler shifts within the channel angle-delay-Doppler spread, respectively. Due to the fixed angle-delay-Doppler sampling of equation (30), which defines the fixed basis functions in equation (31), the virtual representation is a linear channel representation completely characterized by the channel coefficients H_(ν)(i,k,

m). Additionally, equation (32) states that each H_(ν)(i,k,

m) is approximately equal to the sum of the complex gains of all physical paths whose angles, delays, and Doppler shifts lie within an angle-delay-Doppler resolution bin of size Δθ_(R)×Δθ_(T)×Δτ×Δν centered around the virtual sample point ({circumflex over (θ)}_(R,i), {circumflex over (θ)}_(T,k), {circumflex over (τ)}_(l), {circumflex over (ν)}_(m))=(i/N_(R), k/N_(T), l/W, m/T) in the angle-delay-Doppler domain as shown with reference to FIG. 7. The virtual representation of equation (30) effectively approximates a physical MIMO channel in terms of a D_(max)-dimensional parameter comprising the channel coefficients H_(ν)(i,k,l,m), where D_(max)=N_(R)N_(T)L(2M+1).

Based on the interspacings between the multipath clusters within the angle-delay-Doppler domain, MIMO channels can be characterized as either “rich” or “sparse”. In a rich MIMO channel, the interspacings are smaller than Δθ_(R),Δθ_(T),Δτ,Δν). Sparse MIMO channels, on the other hand, exhibit interspacings that are larger than Δθ_(R), Δθ_(T), Δτ, and/or Δν such that not every angle-delay-Doppler bin of size Δθ_(R)×Δθ_(T)×Δτ×Δν contains a physical path as shown with reference to FIG. 7. In particular, since a channel coefficient consists of the sum of the gains of all paths falling within its respective angle-delay-Doppler resolution bin, sparse MIMO channels tend to have far fewer than D_(max) nonzero channel coefficients at any fixed. but large enough number of antennas, signaling duration, and bandwidth. A MIMO channel is D-sparse if D=|S_(D)|<<D_(max), where D_(max)=N_(R)N_(T)L(2M+1) is the total number of resolvable paths (channel coefficients) within the angle-delay-Doppler spread of the channel and S_(D)={(i,k,

m):|H_(ν)(i,k,l,m)|>0}.

If the signaling parameters are chosen so that the channel is non-selective

$\begin{matrix} {H = {{\sum\limits_{n}{\beta_{n}{a_{R}\left( \theta_{R,n} \right)}{a_{T}^{H}\left( \theta_{T,n} \right)}}} \approx {A_{R}H_{v}A_{T}^{H}}}} & (33) \end{matrix}$ where A_(R) and A_(T) are N_(R)×N_(R) and N_(T)×N_(T) unitary discrete Fourier transform (DFT) matrices, respectively. The N_(R)×N_(T) beamspace matrix H_(ν) couples the virtual AoAs and AoDs, and its entries are given by the D_(max)=N_(R)N_(T) channel coefficients {H_(ν)(i,k)}. The channel is assumed to be D-sparse in the angular domain (D=|S_(D)|<<D_(max)) and it remains constant over the packet signaling duration T with a blockfading assumption corresponding to Tν_(max)<<1.

To learn the N_(R) X N_(T) (antenna domain) matrix H, part of the packet duration T is used to transmit a training signal to the receiver. Stacking the M_(tr)=T_(tr)W received vector-valued training signals {y(n),n=1, . . . , M_(tr)} into an M_(tr)×N_(R) matrix Y yields the following system of equations

$\begin{matrix} {Y = {{\sqrt{\frac{ɛ}{M_{tr}}}{XH}^{T}} + W}} & (34) \end{matrix}$ where ε is the total transmit energy budget available for training, X is the collection of M_(tr) training signal vectors {x(n), n=1, . . . , M_(tr)} stacked row-wise into an M_(tr)×N_(R) matrix with the constraint that ∥X∥_(F) ²=M_(tr), and W is an M_(tr)×N_(R) matrix of unit-variance AWGN.

Given receiver processing in the antenna domain, let χ={1, . . . , N_(R)}×{1, . . . , N_(T)} be the set of indices of elements within the antenna domain matrix H, and let the number of receive signal space dimensions dedicated to training be N_(tr)≧c₂·log⁵D_(max)·D for some constant C₂>0, and choose χ_(tr) to be a set of N_(tr) ordered pairs sampled uniformly at random from χ. The number of transmitted training signals may be defined as M_(tr)=|{k:(i,k)εχ_(tr)}| resulting in y_(tr)=√{square root over (ε/M_(tr))}{H(i,k)}_(χtr)+w where y_(tr) is the vector of received training data and w˜CN(0_(N) _(tr) ,I_(N) _(tr) ).

If vec⁻¹ denotes the inverse of the vec operator defined as stacking the columns of a matrix into a vector, and λ=(2{tilde over (ε)}(1+a)log D_(max))^(1/2) for any a≧0 where {tilde over (ε)}=εN_(tr)/D_(max)M_(tr), a_(T,i) ^(T) and a_(R,i) ^(T) denote the i-th row of A_(T)* and A_(R), respectively, and considering an N_(tr)×D_(max) sensing matrix U_(tr) that is comprised of {(a_(T,k) ^(T)

a_(R,i) ^(T)):(i,k)εχ_(tr)} as its rows, the estimate of the channel coefficients is obtained from y_(tr) as follows: Ĥ=A _(R)(vec⁻¹(DS(√{square root over (ε/M _(tr))}U _(tr) ,y _(tr),λ)))A _(T) ^(H)  (35)

The virtual channel model coefficients in equation (35) can be determined as a solution to the Dantzig selector, DS, defined as

$\begin{matrix} {\hat{h} = {{\underset{\overset{\sim}{h} \in C^{D_{\max}}}{argmin}{\overset{\sim}{h}}_{l_{1}}\mspace{14mu}{subject}\mspace{14mu}{to}\mspace{14mu}{{X^{H}r}}_{l_{\infty}}} \leq \lambda}} & (36) \end{matrix}$ where ĥ are the estimated channel coefficients, ∥∥_(l) ₁ is an l₁ norm, ∥∥_(l) _(∞) is an

_(∞) norm, D_(max)=N_(R)N_(T) a maximum number of non-zero channel coefficients, C^(D) ^(max) is a D_(max)-dimensional complex space, X is the sensing matrix √{square root over (ε/M_(tr))}{(a_(T,k) ^(T)

a_(R,i) ^(T)):(i,k)εχ_(tr)}, r is the D dimensional vector of residuals: r=(y_(tr)−X_(tr)ĥ), y is the sampled multipath signal, and λ is a tuning parameter selected to control a number of channel coefficients to be determined such as λ=(2{tilde over (ε)}(1+a)log D_(max))^(1/2). In a non-sparse environment, the same method can be used to determine the first D largest channel coefficients. In another illustrative embodiment, a lasso estimator may be used to determine the channel model coefficients.

Given receiver processing in the beamspace domain, let h_(ν,i) ^(T) denote the i-th row of H_(ν)and define D_(i) to be the number of nonzero virtual coefficients in each row of H_(ν); that is, D_(i)=∥h_(ν,i)∥₀. The number of training vectors may be chosen as M_(tr)≧c₆·log(N_(T)/max_(i)D_(i))·max_(i)D_(i) for some constant c₆>0 and each training vector x(n),n=1 . . . , M_(tr) is an iid vector of binary random variables taking values +1/√{square root over (N_(T))} or −1/√{square root over (N_(T))} with probability 0.5 each. At the receiver, the received training signals {y(n), n=, . . . , M_(tr)} are stacked into an M_(tr)×N_(R) matrix Y to yield equation (34).

To determine the channel coefficients in an illustrative embodiment, define Y_(ν)=YA_(R)* and let y_(ν,i) denote the i-th column of Y_(ν), select a λ=(2ε(1+a)(log D_(max))/N_(T))^(1/2) for an a≧0, and define ĥ_(ν,i)=DS(√{square root over (ε/M_(tr))}XA_(T)*,y_(ν,i),λ) for i=1, . . . , N_(R) where DS denotes the Dantzig selector. The estimate of H is obtained as: Ĥ=A_(R)[ĥ_(ν,1) . . . ĥ_(ν,N) _(R) ]^(T)A_(T) ^(H)  (36) In a non-sparse environment, the same method can be used to determine the first const·M_(tr)/log N_(T) largest nonzero channel coefficients per row of channel matrix H_(ν). In another illustrative embodiment, a lasso estimator may be used to determine the channel model coefficients.

If the signaling parameters are chosen so that the MIMO channel is frequency-selective such that Wτ_(max)≧1, limited to blockfading corresponding to Tν_(max)<<1, and assuming that the communication packet is comprised of N₀≈T/(T_(f)+τ_(max))≧N_(T) OFDM vector-valued symbols with each OFDM symbol consisting of Q=T_(f)W≧┌Wτ_(max)┐+1 tones where T_(f)<T denotes the OFDM symbol duration, the channel model of equation (31) reduces to

$\begin{matrix} {{H(f)} \approx {\sum\limits_{l = 0}^{L - 1}{{\overset{\sim}{H}(l)}{\mathbb{e}}^{{- j}\; 2\;\pi\frac{l}{W}f}}}} & (37) \end{matrix}$ where the antenna domain matrices {tilde over (H)}

's are defined in terms of the beamspace matrices: {tilde over (H)}

≈A_(R)H_(V)

A_(T) ^(H). The channel frequency response H(f) is characterized by D_(max)=N_(R)N_(T)L channel coefficients {H_(ν)(i,k,

}, out of which only D<<D_(max) coefficients are assumed to be nonzero. To learn this D_(max)-dimensional channel, M_(tr) of N₀Q OFDM tones may be selected as “pilot tones” to transmit known vector-valued training signals to the receiver over the selected tones. The transmitted and received training signals in this case are related to each other as

$\begin{matrix} {{{y\left( {n,q} \right)} = {{\sqrt{\frac{ɛ}{M_{tr}}}{H(q)}{x\left( {n,q} \right)}} + {w\left( {n,q} \right)}}},{\left( {n,q} \right) \in P_{tr}}} & (38) \end{matrix}$ where ε is the transmit energy budget available for training, the matrix H(q)=H(f)|_(f=q/T) _(∫) ,w(n,q)˜CN(0_(N) _(R) ,I_(N) _(R) ),P_(tr)⊂{1, . . . , N₀}×{0, . . . , Q−1}:|P_(tr)|=M_(tr), and the set of transmit training vectors x(n,q) is designed such that Σ_(P) _(tr) ∥x(n,q)∥₂ ²=M_(tr).

For an illustrative training signal used in a MIMO channel, let h_(ν,i) ^(T)

denote the i-th row of H_(ν)

and define H_(ν,i)=[h_(ν,i)(0) . . . h_(ν,i)(L−1)]. Further, define D_(i) to be the number of nonzero virtual coefficients in

$H_{v,i}\left( {D_{i} = {\sum\limits_{l = 0}^{L - 1}{{h_{v,i}(l)}}_{0}}} \right)$ and let the number of pilot tones be M_(tr)≧c₉·log⁵(N_(T)Q)max_(i)D_(i) for some constant c₉>0. Define the pilot tones P_(tr) to be a set of M_(tr) ordered pairs sampled uniformly at random from {1, . . . , N_(T)}×{0, . . . , Q−1}, and the corresponding training vectors as {x(n,q)=e_(n):(n,q)εP_(tr)}. At the receiver, the received signals {y(n,q)}_(P) _(tr) are stacked row-wise to yield an M_(tr)×N_(R) matrix Y consisting of y(n,q)'s as its rows.

To determine the channel coefficients, define an M_(tr)×N_(T)L matrix U_(tr) that is comprised of {(u_(f,q) ^(T)

a_(T,n) ^(T)):(n,q)εP_(tr)} as its rows where,

$u_{f,q}^{T} = \left\lbrack {{\mathbb{e}}^{{- j}\; 2\;\pi\frac{q}{Q}0}\mspace{14mu}\ldots\mspace{14mu}{\mathbb{e}}^{{- j}\; 2\;\pi\frac{q}{Q}{({L - 1})}}} \right\rbrack$ and a_(T,n) ^(T) denotes the n-th row of A_(T)*, choose λ=(2ε(1+a)(log D_(max))/N_(T))^(1/2) for any a≧0, define Y_(ν)=YA_(R)*, and let y_(ν,i) denote the i-th column of Y_(ν). The estimate of H_(ν,i) is given as follows: Ĥ _(ν,i)=vec⁻¹(DS(√{square root over (ε/M _(tr))}U _(tr) ,y _(ν,i),λ))  (39) where DS denotes the Dantzig selector. In a non-sparse environment, the same method can be used to determine the first const·M_(tr)/log⁵(N_(T)Q) largest nonzero channel coefficients for H_(ν,i) corresponding to an output of each receive antenna. In another illustrative embodiment, a lasso estimator may be used to determine the channel model coefficients.

In another exemplary embodiment, a training signal comprising one OFDM symbol may be used. The described processes can further be applied in a MIMO, doubly selective signal space that employs STF signaling.

The word “illustrative” is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as “illustrative” is not necessarily to be construed as preferred or advantageous over other aspects or designs. Further, for the purposes of this disclosure and unless otherwise specified, “a” or “an” means “one or more”. Further, for the purposes of this disclosure, “and” or “or” means “and/or”. The illustrative embodiments may be implemented as a method, machine, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, and/or any combination thereof to control a device to implement the disclosed embodiments.

The foregoing description of illustrative embodiments of the invention have been presented for purposes of illustration and of description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiments were chosen and described in order to explain the principles of the invention and as practical applications of the invention to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents. 

1. A device comprising: an antenna configured to receive a multipath signal; and a processor operably coupled to the antenna to receive the multipath signal, the processor configured to determine a training signal transmitted from a second device to create the received multipath signal; sample the received multipath signal; and determine channel coefficients based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process, wherein the channel coefficients characterize a channel associated with the multipath signal.
 2. The device of claim 1, wherein the device is the second device.
 3. The device of claim 2, wherein the device is a sensor.
 4. The device of claim 2, wherein the antenna is further configured to transmit the training signal.
 5. The device of claim 1, wherein the antenna is further configured to transmit the determined channel coefficients to the second device.
 6. A method of determining channel coefficients characterizing a channel associated with a multipath signal, the method comprising: receiving a multipath signal at a first device; using a processor at the first device, determining a training signal transmitted from a second device to create the received multipath signal; sampling the received multipath signal; and determining channel coefficients based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process, wherein the channel coefficients characterize a channel associated with the multipath signal.
 7. The method of claim 6, further comprising determining a resolution value based on a signaling characteristic of the determined training signal.
 8. The method of claim 7, wherein the received multipath signal is sampled uniformly at the determined resolution value.
 9. The method of claim 7, wherein the channel coefficients are determined using a discrete approximation of a continuous time channel based on the determined resolution value.
 10. The method of claim 6, wherein the mixed-norm convex optimization process comprises a Dantzig selector.
 11. The method of claim 10, wherein the mixed-norm convex optimization $\hat{\beta} = {\underset{\overset{\sim}{\beta} \in C^{P}}{argmin}{\overset{\sim}{\beta}}_{l_{1}}}$ subject to ∥X^(H)r∥_(l) _(∞) ≦λ where {circumflex over (β)} are the determined channel coefficients, ∥∥_(l) ₁ is an l₁ norm, ∥∥_(l) _(∞) is an l_(∞) norm, p is a maximum number of channel coefficients, C^(p) is a p-dimensional complex space, X is a sensing matrix, r=y−X{tilde over (β)} is a vector of residuals, y is the sampled multipath signal, and λ is a tuning parameter selected to control a number of channel coefficients determined.
 12. The method of claim 11, wherein X comprises an (n+p−1)×p Toeplitz-structured, convolution matrix formed from the training signal, n is ┌T_(S)W┐ where T_(S) is a signaling duration of the training signal and W is a bandwidth of the training signal.
 13. The method of claim 12, wherein the training signal comprises a pseudo-random sequence randomly selected from a zero mean, unit variance distribution.
 14. The method of claim 11, wherein X comprises ${X = \left\lfloor {{u_{0} \otimes x_{0}}\mspace{14mu}\ldots\mspace{14mu}{u_{{\overset{\sim}{N}}_{0} - 1} \otimes x_{{\overset{\sim}{N}}_{0} - 1}}} \right\rfloor^{T}}\mspace{14mu}$ ${{{{where}\mspace{14mu} u_{n}} = \left\lbrack {\omega_{N_{o}}^{Kn}\mspace{14mu}\omega_{N_{o}}^{{({K - 1})}n}\mspace{14mu}\ldots\mspace{14mu}\omega_{N_{o}}^{- {Kn}}} \right\rbrack^{T}},{\omega_{N_{0}} = {\mathbb{e}}^{{- j}\frac{2\pi}{N_{o}}}}}\mspace{14mu}$ ${{{and}\mspace{14mu} n} = 0},1,\ldots\mspace{14mu},{{\overset{\sim}{N}}_{0} - 1},{{\overset{\sim}{N}}_{0} = {N_{0} + L - 1}},{N_{0} \approx {TW}},$ T is a packet duration of the training signal, W is a bandwidth of the training signal, L=┌Wτ_(max)┐+1 τ_(max) is the delay spread of the channel, K=┌Tv_(max)/2┐, and v_(max) is a maximum, one-sided Doppler shift caused by the channel.
 15. The method of claim 14, wherein the training signal comprises a single-carrier spread spectrum waveform.
 16. The method of claim 15, wherein a spreading code, {x_(n)}, of the single-carrier spread spectrum waveform is generated from a Rademacher distribution, where the x_(n)'s independently take values of √{square root over (ε/N₀)} or −√{square root over (ε/N₀)} with probability of 0.5 each where ε is a transmit energy budget for the training signal.
 17. The method of claim 6, wherein the sampled multipath signal is formed by projecting the received multipath signal onto a plurality of basis elements.
 18. The method of claim 11, wherein the mixed-norm convex optimization process is performed for each receive antenna of a plurality of receive antennas.
 19. The method of claim 6, wherein the mixed-norm convex optimization process comprises a Lasso estimator.
 20. A non-transitory computer-readable medium having computer-readable instructions stored thereon which, when executed by a processor, cause a device to: determine a training signal transmitted from a second device to create a multipath signal received at the device; sample the received multipath signal; and determine channel coefficients based on the sampled multipath signal and the determined training signal using a mixed-norm convex optimization process, wherein the channel coefficients characterize a channel associated with the multipath signal. 